Quadruple systems with independent neighborhoods
نویسندگان
چکیده
منابع مشابه
Quadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max α { α ( n− α 3 ) + (n− α) ( α 3 )} = ( 1 2 + o(1) )( n 4 ) denote the maximum number of edges in an n-vertex odd 4-graph. Let n be sufficiently large, and let G be an n-vertex 4-graph such that for every triple xyz of vertices, the neighborhood ...
متن کاملHypergraphs with independent neighborhoods
For each k ≥ 2, let ρk ∈ (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (ρk + o(1)) ( n k ) edges as n → ∞. We prove that ρk = 1 − 2 log k/k + Θ(log log k/k) as k → ∞. This disproves a conjecture of Füredi and the last two authors.
متن کاملAlmost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a vertex subset X such that every edge of H intersects X in exactly two points. It is easy to see that if H is semi-bipartite, then the neighborhood of every pair of vertices in H is an independent set. We show a partial...
متن کاملThe independent neighborhoods process
A triangle T (r) in an r-uniform hypergraph is a set of r + 1 edges such that r of them share a common (r − 1)-set of vertices and the last edge contains the remaining vertex from each of the first r edges. Our main result is that the random greedy triangle-free process on n points terminates in an r-uniform hypergraph with independence number O((n log n)). As a consequence, using recent result...
متن کاملAffine - invariant quadruple systems
Let t, v, k, λ be positive integers satisfying v > k > t. A t-(v, k, λ) design is an ordered pair (V,B), where V is a finite set of v points, B is a collection of k-subsets of V , say blocks, such that every t-subset of V occurs in exactly λ blocks in B. In what follows we simply write t-designs. A 3-(v, 4, 1) design is called a Steiner quadruple system and denoted by SQS(v). It is known that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2008
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2008.01.008